reachability matrix
英 [riːtʃəˈbɪlɪti ˈmeɪtrɪks]
美 [ˌritʃəˈbɪlɪti ˈmeɪtrɪks]
网络 可达矩阵; 可达性矩阵; 可及矩阵
双语例句
- A Improved Simple Algorithm to Compute Reachability Matrix with Adjacency Matrix
由邻接矩阵求解可达矩阵的一种改进简便算法 - The reachability matrix of directed graph plays a very important role on identifying whether a directed graph to be strongly connected or not and calculating the strongly connected sub graph.
图的可达性矩阵在判断图的强连通性以及求强连通分图中具有重要作用。 - Moreover, introduce the idea of reachability matrix, by which, figure out the average transfer times and come out the arithmetic.
引入了可达矩阵的概念，利用可达矩阵计算出了公交线网的平均换乘次数，并给出了算法。 - Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.
可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。 - The model is validated by reachability tree and state matrix equations of Petri Net, and the validation result is that the model can be reachable.
同时，本文运用Petri网系统的可达树方法和状态矩阵方程的方法对模型进行了可达性验证，经验证该模型是安全可达的。 - An ontology graph model, which creates ontology adjacency matrix and ontology reachability matrix, is described. Depending on matrix shift and calculation, ripple-effect of ontology evolution can be analyzed and its quantity can be ascertained.
本文提出了一种本体图模型，建立了本体邻接矩阵和可达矩阵，凭借矩阵变换与运算对本体演化中的波及效应进行了深入的分析和量化界定； - A simple and direct algorithm for computing reachability matrix of directed graph is introduced and proved.
介绍了采用邻接矩阵作关系矩阵解有向图的可达矩阵的一种简捷算法&轮流做媒法。 - The reachability degree and its matrix character have been done, when the maximum strong component is defined. On the basis of the maximum strong component, the standard form in Fuzzy Matrix is given, and the maximum reachability degree analysis of the network is realized.
在完成了可达程度及其矩阵刻画的基础上，提出了极大强支的概念，由之建立了模糊阵的一种标准型，实现了对网络的最大可达程度分析。 - It is proved that there is no need to calculate the reachability matrix for a Directed Acyclic Graph ( DAG).
证明了对于一类特殊的有向图即有向无环图（DAG），应用解释结构建模法无须求解可达矩阵亦可保证建模结构化的实现。 - A simple and direct algorithm for computing reachability matrix& method of acting as an intermediary in turn
求可达矩阵的简捷算法&轮流做媒法 - Conditional digraph is represented by connectivity matrix C and conditional matrix D and an algorithm for computing reachability matrix R is devised.
条件有向图需要二种矩阵（连通矩阵C及条件矩阵D）进行表示。 - In the Attribute Petri Net, the start rule of transition and calculation of place marking are different from traditional Petri Nets. Therefore, we redefined APN transition fired condition, reachability marking set, the incidence matrix and status equation.
在属性Petri网中，变迁的启动规则以及库所标识的计算都有别于传统的Petri网，因此，本文重新定义了APN的变迁点火条件、可达标识集、关联矩阵和状态方程。 - A way of fuzzy cluster is provided, which is combined with reachability matrix and the idea of region partition in graph theory, in order to find out the number of the hidden layer nodes of RBF neural network.
本文提出一种同图论中可达矩阵和区域划分思想相结合的模糊聚类方法，以此来确定RBF网络的隐含层节点数。 - Controllability and Reachability of a Class of Linear Switched Systems with the Same Input Matrix
输入矩阵定常的切换线性系统的能控性和能达性 - Reachability matrix of directed graph and calculation based on matrix calculation
基于布尔矩阵运算的有向图可达矩阵 - Ripple-Effect Analysis of Software Architecture Evolution Based on Reachability Matrix
基于可达矩阵的软件体系结构演化波及效应分析 - An improved algorithm for process topology analysis has been proposed and programmed in ALGOL 60. By means of a comparative study, the author decided to use reachability matrix technique for identification.
对化工流程的拓扑分析，提出了一种改进算法，并用ALGOL60语言编写了程序。注重对学生创新能力的培养。创新能力因子； - New Formula of Reachability Matrix
可达矩阵的新求法 - Petri net is a kind of good tool to describe concurrent and asynchronous system, there are many methods to analyze Petri net, such as reachability graph, reachability tree, incidence matrix and so on. However, its correctness can be proved by mathematics method.
Petri网是一个描述异步并发的图形工具，具有可达树、可达图、关联矩阵等多种分析方法，并且可以通过数学方法来证明其正确性； - We define white graph and white condensation for nonautonomous and nonlinear DEDS, obtain two necessary and sufficient conditions of reachability and observability, and canonical structure for the system, also give their matrix descriptions.
对于非自治非线性DEDS，定义了白色图和凝白色图，得到了系统能达和能观的充要条件，以及系统的标准结构，并给出了它们的矩阵描述。 - Discuss the Way of Reachability Matrix
关于可达矩阵的求法探讨 - The paper also introduces the adjacency matrix and the reachability matrix expressing the connectivity between two sites and reachability after "a certain path".
引入邻接矩阵和可达矩阵描述了两两站点的直接相连关系和经过一定长度通路的可达程度。